Multi-Query Feedback Motion Planning with LQR-Roadmaps

نویسندگان

  • Anirudha Majumdar
  • Mark Tobenkin
  • Russ Tedrake
چکیده

Here we present an algorithm which addresses the need to produce high performance, provably stable feedback controllers for constrained nonlinear systems with goals and constraints that are not fully specified until runtime. Our approach is to precompute a multi-query directed “roadmap”, with each segment representing a locally optimal trajectory of the system and a continuous family of verified finite-time invariant sets, or “funnels”, associated with an LQR controller computed for the trajectory. The result is a library of parameterized local feedback skills which can be efficiently assembled into a provably stable feedback controller at runtime that takes the system from any point in a bounded region in state space to any stabilizable goal state. The paper makes a number of technical contributions, including formulations for exact algebraic verification using Sums-of-Squares optimization of Lyapunov stability for sets of stabilizable goal states exploiting the state-dependent riccati equations (SDRE) and for parameterized finite-time invariance around a trajectory, as well as a “roadmap” construction algorithm that provides probabilistic feedback coverage for any runtime goal in the stabilizable set of the system. We demonstrate our approach with a number of numerical examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LQR-trees: Feedback motion planning on sparse randomized trees

Recent advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of stability for smooth nonlinear systems. Here we present a feedback motion planning algorithm which uses these results to efficiently combine locally-valid linear quadratic regulator (LQR) controllers into a nonlinear feedback policy which probabilisticall...

متن کامل

Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps

We propose the combination of techniques that solve multiple queries for motion planning problems with single query planners in a motion planning framework that can be efficiently parallelized. In multiple query motion planning, a data structure is built during a preprocessing phase in order to quickly respond to on-line queries. Alternatively, in single query planning, there is no preprocessin...

متن کامل

Creating Small Roadmaps for Solving Motion Planning Problems

In robot motion planning, many algorithms have been proposed that create a roadmap from which a path for a moving object can be extracted. These algorithms generally do not give guarantees on the quality of the roadmap, i.e. they do not promise that a path will always be found in the roadmap if one exists in the world. Furthermore, such roadmaps often become very large which can cause memory pr...

متن کامل

Lazy Toggle PRM: An Efficient Motion Planning Strategy for Task Sequences

Probabilistic RoadMaps (PRMs) are quite successful in solving complex and high-dimensional motion planning problems. While particularly suited for multiple-query scenarios and expansive spaces, they lack efficiency in both solving a small number of queries in an environment and mapping narrow spaces. Two PRM variants separately tackle these gaps. Lazy PRM reduces the computational cost of roadm...

متن کامل

Constructing probabilistic roadmaps with powerful local planning and path optimization

This paper describes a new approach to probabilistic roadmap construction for path planning. The novel feature of the planner is that it uses a powerful local planner to produce highly connected roadmaps and path optimization to maintain the rapid query processing by a fast local operator. While most previous approaches obtain good roadmaps by advanced sampling methods, the presented approach c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011